Bayesian Degree-Corrected Stochastic Block Models for Community Detection

نویسندگان

  • Lijun Peng
  • Luis Carvalho
چکیده

Community detection in networks has drawn much attention in diverse fields, especially social sciences. Given its significance, there has been a large body of literature among which many are not statistically based. In this paper, we propose a novel stochastic blockmodel based on a logistic regression setup with node correction terms to better address this problem. We follow a Bayesian approach that explicitly captures the community behavior via prior specification. We then adopt a data augmentation strategy with latent Pólya-Gamma variables to obtain posterior samples. We conduct inference based on a canonically mapped centroid estimator that formally addresses label non-identifiability. We demonstrate the novel proposed model and estimation on real-world as well as simulated benchmark networks and show that the proposed model and estimator are more flexible, representative, and yield smaller error rates when compared to the MAP estimator from classical degree-corrected stochastic blockmodels.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consistency of community detection in networks under degree-corrected stochastic block models

Community detection is a fundamental problem in network analysis, with applications in many diverse areas. The stochastic block model is a common tool for model-based community detection, and asymptotic tools for checking consistency of community detection under the block model have been recently developed. However, the block model is limited by its assumption that all nodes within a community ...

متن کامل

A spectral method for community detection in moderately-sparse degree-corrected stochastic block models

We consider community detection in Degree-Corrected Stochastic Block Models (DCSBM). We propose a spectral clustering algorithm based on a suitably normalized adjacency matrix. We show that this algorithm consistently recovers the block-membership of all but a vanishing fraction of nodes, in the regime where the lowest degree is of order log(n) or higher. Recovery succeeds even for very heterog...

متن کامل

Community Detection via Discriminant functions for Random Walks in the degree-corrected Stochastic Block Model

Recent work theoretically connected the problem of seed set expansions with personalized page rank by showing that the optimal weights of random walk landing probabilities when constructing a classifier for community detection of nodes in the stochastic block model followed the weights in personalized page rank [3]. One drawback of the stochastic block model is that it can be unrealistic as a m...

متن کامل

Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models

Motivated by community detection, we characterise the spectrum of the non-backtracking matrix B in the Degree-Corrected Stochastic Block Model. Specifically, we consider a random graph on n vertices partitioned into two equalsized clusters. The vertices have i.i.d. weights {φu}u=1 with second moment Φ. The intra-cluster connection probability for vertices u and v is φuφv n a and the inter-clust...

متن کامل

Convexified Modularity Maximization for Degree-corrected Stochastic Block Models

The stochastic block model (SBM) is a popular framework for studying community detection in networks. This model is limited by the assumption that all nodes in the same community are statistically equivalent and have equal expected degrees. The degree-corrected stochastic block model (DCSBM) is a natural extension of SBM that allows for degree heterogeneity within communities. This paper propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1309.4796  شماره 

صفحات  -

تاریخ انتشار 2013